BiBinConvmean : A Novel Biclustering Algorithm for Binary Microarray Data
نویسندگان
چکیده
In this paper, we present a new algorithm called, BiBinConvmean, for biclustering of binary microarray data. It is a novel alternative to extract biclusters from sparse binary datasets. Our algorithm is based on Iterative Row and Column Clustering Combination (IRCCC) and Divide and Conquer (DC) approaches, K-means initialization and the CroBin evaluation function [6]. Applied on binary synthetic datasets, our algorithm outperforms other biclustering algorithms for binary microarray data. Biclusters with different numbers of rows and columns can be detected, varying from many rows to few columns and few rows to many columns. Our algorithm allows the user to guide the search towards biclusters of specific dimensions. Keywords-component; Biclustering, binary data, microarray data, Iteratif Row Column Combinaison approach, Divide and Conquer approach, CroBin.
منابع مشابه
A Binary Factor Graph Model for Biclustering
Biclustering, which can be defined as the simultaneous clustering of rows and columns in a data matrix, has received increasing attention in recent years, particularly in the field of Bioinformatics (e.g. for the analysis of microarray data). This paper proposes a novel biclustering approach, which extends the Affinity Propagation [1] clustering algorithm to the biclustering case. In particular...
متن کاملDNA Microarray Data Analysis: A Novel Biclustering Algorithm Approach
Biclustering algorithms refer to a distinct class of clustering algorithms that perform simultaneous row-column clustering. Biclustering problems arise in DNAmicroarray data analysis, collaborative filtering, market research, information retrieval, text mining, electoral trends, exchange analysis, and so forth. When dealing with DNA microarray experimental data for example, the goal of bicluste...
متن کاملPropagation-Based Biclustering Algorithm for Extracting Inclusion-Maximal Motifs
Biclustering, which is simultaneous clustering of columns and rows in data matrix, became an issue when classical clustering algorithms proved not to be good enough to detect similar expressions of genes under subset of conditions. Biclustering algorithms may be also applied to different datasets, such as medical, economical, social networks etc. In this article we explain the concept beneath h...
متن کاملImproved biclustering of microarray data demonstrated through systematic performance tests
A new algorithm is presented for 4tting the plaid model, a biclustering method developed for clustering gene expression data. The approach is based on speedy individual di6erences clustering and uses binary least squares to update the cluster membership parameters, making use of the binary constraints on these parameters and simplifying the other parameter updates. The performance of both algor...
متن کاملAn FPGA-based Geometric Biclustering Accelerator for Genes Microarray Data Analysis
This paper introduces a novel hardware architecture for accelerating geometric biclustering (GBC) algorithm for genes microarray data analysis on FPGA. The proposed FPGAbased accelerator provides high throughput parallel processing capability and improves the speed of GBC computation by 30% compared to purely software implementation written in C language.
متن کامل